Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
21	1 Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:04 Mathematics Dynamic programming Combinatorics Formal languages Discrete mathematics Longest common subsequence problem Subsequence Substring
22	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree
23	Distributed Computing Prof. R. Wattenhofer B/M/S/G Plan my vacation Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-06-14 07:19:14 Mathematics Cryptography Operations research Dynamic programming Knapsack problem Algorithm Applied mathematics
24	Linear Dynamic Programming and the Training of Sequence Estimators Christopher Raphael? and Eric Nichols?? Abstract We consider the problem of finding an optimal path through a trellis graph when the arc costs are linear Add to Reading List Source URL: music.informatics.indiana.edu Language: English - Date: 2010-06-29 17:34:24 Statistics Statistical theory Systems science Mathematical optimization Estimation theory Markov models Dynamic programming Equations Systems engineering Loss function Maximum likelihood estimation Viterbi algorithm
25	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
26	On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch Add to Reading List Source URL: webdb2011.rutgers.edu Language: English - Date: 2011-05-31 18:17:42 Computational complexity theory Mathematics Edsger W. Dijkstra Graph theory Algorithm Mathematical logic Theoretical computer science Shortest path problem NP Dynamic programming
27	An Algorithm for Differential File Comparison J. W. Hunt Department of Electrical Engineering, Stanford University, Stanford, California M. D. McIlroy Bell Laboratories, Murray Hill, New Jersey 07974 Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2013-02-15 00:09:52 Mathematics Dynamic programming Combinatorics Discrete mathematics Formal languages Data differencing HuntMcIlroy algorithm Longest increasing subsequence Longest common subsequence problem Subsequence Diff utility Data comparison
28	155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-25 10:24:53 Mathematics Graph theory Discrete mathematics Edsger W. Dijkstra Routing algorithms Operations research Network theory Shortest path problem Dynamic programming Distance Path Linear programming
29	The Top Ten List: Dynamic Fault Prediction Ahmed E. Hassan and Richard C. Holt Software Architecture Group (SWAG) School of Computer Science University of Waterloo Waterloo, Canada Add to Reading List Source URL: plg.uwaterloo.ca Language: English - Date: 2005-07-08 17:14:20 Engineering Design Heuristic Fault Reliability engineering Problem solving
30	Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract Add to Reading List Source URL: www.econ2.uni-bonn.de Language: English - Date: 2014-03-26 06:49:17 Operations research Dynamic programming Mathematics Mathematical optimization Combinatorial optimization Applied mathematics Bellman equation Control theory Knapsack problem Systems science Mechanism design

UPDATE